State space generation for the HAVi leader election protocol

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Model Checking the HAVi Leader Election Protocol

The HAVi specification [9] proposes an architecture for audio/video interoperability in home networks. Part of the HAVi specification is a distributed leader election protocol. We have modelled this leader election protocol in Promela and Lotos and have checked several properties with the tools Spin and Xtl (from the Cæsar/Aldébaran

متن کامل

A comparison of Spin and the muCRL toolset on HAVi leader election protocol

This paper describes an attempt to compare two toolsets allowing generation of finite labeled transition systems from underlying concurrent specification languages. The comparison is done on a specification of the leader election protocol from Home Audio/Video interoperability (HAVi) architecture. Some important semantical differences of PROMELA and μCRL are identified, that lead to big differe...

متن کامل

Self-Stabilizing Leader Election in Optimal Space

A silent self-stabilizing asynchronous distributed algorithm, SSLE, for the leader election problem, in a connected unoriented network with unique IDs, is given. SSLE uses O(log n) space per process and stabilizes in O(n) rounds, where n is the number of processes in the network.

متن کامل

Group Leader Election under Link - State

In this work, we place the problem of group leader election in a context \inside the network," meaning that participants in the election process are network switches/routers, rather than hosts. A robust solution to the problem, called the Network Leader Election (NLE) protocol, is proposed for use in networks based on link-state routing (LSR). The protocol is robust , for it achieves leadership...

متن کامل

Group leader election under link-state routing

In this work, we place a long-established distributed computing problem in a new context. Speciically, the group leader election problem is studied \in-side the network," meaning that participants in the election process are network switches/routers, rather than hosts. In this context, an election protocol can take advantage of certain internal operations of the network, such as the underlying ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Science of Computer Programming

سال: 2002

ISSN: 0167-6423

DOI: 10.1016/s0167-6423(01)00018-1